Learning to Make Reasonable Assumptions

نویسندگان

  • Steve Gardiner
  • Eugene Fink
چکیده

We describe a general mechanism for the dynamic learning of default assumptions about unknown parameters in a complex problem. We evaluate the mechanism in the context of scheduling an academic conference, utilizing an existing scheduling system. We show that the assumptions help the system find better schedules in the presence of uncertainty, and further that the assumptions aid the system’s elicitaiton procedure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward a Justification of Meta-learning: Is the No Free Lunch Theorem a Show-stopper?

We present a preliminary analysis of the fundamental viability of meta-learning, revisiting the No Free Lunch (NFL) theorem. The analysis shows that given some simple and very basic assumptions, the NFL theorem is of little relevance to research in Machine Learning. We augment the basic NFL framework to illustrate that the notion of an Ultimate Learning Algorithm is well defined. We show that, ...

متن کامل

The Effect of Electronical Media on the Reinforcement of Social Behavior of Youth from the Computer Course Professors and Students Viewpoints of Sari Islamic Azad University

The goal of research was the effect of electronical learning media on the reinforcement of youth social behavior from the point of view of computer course professors and students of Islamic Azad University of Sari. The statistical population was included of all computer students and professors of I.A.U of Sari. The statistical sample was identified by using of the sample content identification ...

متن کامل

Learning Context Free Grammars in the Limit Aided by the Sample Distribution

We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite set of structures and the class of languages learnable by the algorithm depends on this parameter. Every context free language belongs to many such learnable classes. A second part of the algorithm is then used to determ...

متن کامل

Online Learning: Stochastic, Constrained, and Smoothed Adversaries

Learning theory has largely focused on two main learning scenarios: the classical statistical setting where instances are drawn i.i.d. from a fixed distribution, and the adversarial scenario wherein, at every time step, an adversarially chosen instance is revealed to the player. It can be argued that in the real world neither of these assumptions is reasonable. We define the minimax value of a ...

متن کامل

مطالعه ارتباط بین قابلیت یادگیری سازمانی و رضایت شغلی کارکنان در بیمارستان‌های شهر تهران

Background and Aim: Scientific and technological developments have promoted the status of organizational learning as a reasonable way to deal with the present changing circumstances. The development of organizational learning improves the performance of employees, and makes them feel satisfied. The aim of this study is to investigate the relationship between job satisfaction and organizational ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008